A Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling Repairman Problem

Travelling Repairman Problem (TRP) is one variant of the Travelling Salesman Problem (TSP) with the objective function minimizing the total waiting time for customers served by the repairman. Finding TRP solution is very important because it is often encountered in real world cases. In the TRP, a customer requires a fast service that he was satisfied. TRP is a combinatorial problem that requires a long computing time especially for large problems. For such problems, metaheuristics approaches are more efficient than the exact approach i.e mixed integer programming. Cross Entropy is one of relatively new metaheuristics techniques that has shown good results to solve some combinatorial optimization problems. Meanwhile, Tabu Search algorithm is often used for the completion of combinatorial optimization problems with great results. In this paper the hybrid both methods is used to obtain better results in solving the Travelling Repairman Problem.